| 1. | Train incremental garbage collection algorithm
火车增量垃圾收集算法 |
| 2. | Because the garbage collection algorithm is nondeterministic , the
由于垃圾回收算法是非确定性的，因此可能会立即调用 |
| 3. | When evaluating a garbage collection algorithm , we might consider any or all of the following criteria
在对垃圾收集算法进行评价时，我们可能要考虑以下所有标准： |
| 4. | John wiley sons , 1997 is a comprehensive survey of garbage collection algorithms , with an extensive bibliography
John wiley sons ， 1997年是对垃圾收集算法的全面评述，包括大量参考书目。 |
| 5. | The garbage collection algorithm is nondeterministic , so you cannot determine when the clr will release an object s resources
垃圾回收算法是非确定性的，因此无法确定clr释放对象资源的时间。 |
| 6. | Because garbage collection algorithms vary , some algorithms analyze older , longer - lived objects less frequently than short - lived objects
由于各种垃圾收集算法有所不同，某些算法会更频繁地分析生存期较短的对象，而不是较老、生存期较长的对象。 |
| 7. | Many garbage collection algorithms require dividing the heap into separate memory spaces , some of which may be inaccessible to the user program at certain times
许多垃圾收集算法需要将堆分割成独立的内存空间，其中一些空间在某些时刻对用户程序是不可访问的。 |
| 8. | The problem faced by all garbage collection algorithms is the same - identify blocks of memory that have been dispensed by the allocator , but are unreachable by the user program
所有垃圾收集算法所面临的问题是相同的找出由分配器分配的，但是用户程序不可到达的内存块。 |
| 9. | Some garbage collection algorithms require significant cooperation from the compiler or runtime environment , such as updating reference counts whenever a pointer assignment is performed
一些垃圾收集算法要求编译器或者运行时环境的重要配合，如当进行指针分配时更新引用计数。 |
| 10. | The runtime s garbage collection algorithm is based on several generalizations that the computer software industry has discovered to be true by experimenting with garbage collection schemes
运行时的垃圾回收算法基于以下几个普遍原理，这些垃圾回收方案的原理已在计算机软件业通过实验得到了证实。 |
